Globally analytic triangularization of a matrix function
نویسندگان
چکیده
منابع مشابه
Approximate Joint Matrix Triangularization
We consider the problem of approximate joint triangularization of a set of noisy jointly diagonalizable real matrices. Approximate joint triangularizers are commonly used in the estimation of the joint eigenstructure of a set of matrices, with applications in signal processing, linear algebra, and tensor decomposition. By assuming the input matrices to be perturbations of noise-free, simultaneo...
متن کاملReliable numerical methods for polynomial matrix triangularization
Numerical procedures are proposed for triangularizing polynomial matrices over the eld of polynomial fractions and over the ring of polynomials. They are based on two standard polynomial techniques: Sylvester matrices and interpolation. In contrast to other triangularization methods, the algorithms described in this paper only rely on well-worked numerically reliable tools. They can also be use...
متن کاملHouseholder triangularization of a quasimatrix
A standard algorithm for computing the QR factorization of a matrix A is Householder triangularization. Here this idea is generalized to the situation in which A is a quasimatrix, that is, a “matrix” whose “columns” are functions defined on an interval [a,b]. Applications are mentioned to quasimatrix leastsquares fitting, singular value decomposition, and determination of ranks, norms, and cond...
متن کاملa genre analytic study of research papers written by bilingual writers and their beliefs: a case of persian-english writers
تحقیق حاضر گزارشی است از تحلیل بخش مقدمه دو دسته از مقالات که عبارتند از: 11 مقاله از دو نویسنده دوزبانه فارسی زبان, که شامل مقدمه 4 مقاله به زبان انگلیسی و چاپ شده در مجلات بین المللی, مقدمه 3 مقاله به زبان انگلیسی و 4 مقاله به زبان فارسی چاپ شده در مجلات داخلی می شود؛ و 12 مقاله از محققان خارجی که در مجله applied linguistics به چاپ رسیده است. مبنای تئوری این تحلیل ها نظریه سوئلز (1990) یا هما...
15 صفحه اولTowards Computing a Gröbner Basis of a Polynomial Ideal over a Field by Using Matrix Triangularization
We give first results of our investigation of the connection between Gröbner bases computation and Gaussian elimination. We show that for every input set F of polynomials a matrix of shifts of those polynomials exists such that by triangularizing this matrix we obtain a Gröbner basis of F .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1992
ISSN: 0024-3795
DOI: 10.1016/0024-3795(92)90172-7